Flato-Fronsdal theorem for higher-order singletons

Singleton field theory and Flato - Fronsdal dipole equation

We study solutions of the equations (△ − λ)φ = 0 and (△ − λ) 2 φ = 0 in global coordinates on the covering space CAdS d of the d-dimensional Anti de-Sitter space subject to various boundary conditions and their connection to the unitary irre-ducible representations of SO(d − 1, 2). The " vanishing flux " boundary conditions at spatial infinity lead to the standard quantization scheme for CAdS d...

Higher - Order Automated Theorem Proving for NaturalLanguage

This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.

Higher-Order Automated Theorem Proving

The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification...

Higher-Order Automated Theorem Provers

Application Specific Higher Order Logic Theorem Proving

Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...